Remarks on the optimal convolution kernel for CSOR waveform relaxation
نویسندگان
چکیده
Min Hu a,∗, Ken Jackson b,∗, Jan Janssen c,∗∗ and Stefan Vandewalle c,∗∗∗ a Comnetix Computer Systems Inc., 1440 Hurontario Street, Mississauga, Ontario, Canada L5G 3H4 E-mail: [email protected] b Department of Computer Science, University of Toronto, 10 King’s College Road, Toronto, Ontario, Canada M5S 3G4 E-mail: [email protected] c Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium E-mail: {janj,stefan}@cs.kuleuven.ac.be
منابع مشابه
Remarks on the Optimal Convolution Kernel for Csor Waveform Relaxation M. Hu Et Al./ Optimal Convolution Sor Waveform Relaxation 2
The convolution SOR waveform relaxation method is a numerical method for solving large-scale systems of ordinary diierential equations on parallel computers. It is similar in spirit to the SOR acceleration method for solving linear systems of algebraic equations, but replaces the multiplication with an overrelax-ation parameter by a convolution with a time-dependent overrelaxation function. Its...
متن کاملRemarks on the optimal convolutionkernel for CSOR waveform
The convolution SOR waveform relaxation method is a numerical method for solving large-scale systems of ordinary diierential equations on parallel computers. It is similar in spirit to the SOR acceleration method for solving linear systems of algebraic equations, but replaces the multiplication with an overrelax-ation parameter by a convolution with a time-dependent overrelaxation function. Its...
متن کاملOptimal Convolution Sor Acceleration of Waveform Relaxation with Application to Semiconductor Device Simulation
In this paper we describe a novel generalized SOR algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the convolution SOR algorithm is...
متن کاملKrylov Subspace Acceleration of Waveform Relaxation
In this paper we describe and analyze Krylov subspace techniques for accelerating the convergence of waveform relaxation for solving time dependent problems. A new class of accelerated waveform methods, convolution Krylov subspace methods, is presented. In particular, we give convolution variants of the conjugate gradient algorithm and two convolution variants of the GMRES algorithm and analyze...
متن کاملA Unified Framework Based on Operational Calculus for the Convergence Analysis of Waveform Relaxation Methods
Waveform relaxation methods are iterative methods for the solution of systems of ordinary differential equations. The convergence analysis of waveform relaxation methods traditionally uses the theory of Volterra convolution equations. More specifically, the convergence theory is typically based on a theorem of Paley and Wiener that gives a condition for the solution of a linear Volterra convolu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Comput. Math.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997